Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
971	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
972	Precise Concurrent Zero Knowledge Omkant Pandey∗ Rafael Pass† Amit Sahai∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-02-01 05:01:22 Cryptographic protocols Zero-knowledge proof IP NP Commitment scheme Randomized algorithm Alice and Bob Interactive proof system Proof of knowledge Theoretical computer science Computational complexity theory Cryptography
973	Armadillo: a compilation chain for privacy preserving applications Sergiu Carpov, Paul Dubrulle, Renaud Sirdey CEA, LIST, Embedded Real Time & Security Laboratory, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-10 03:12:34 Mathematics Logic in computer science Homomorphic encryption Computational complexity theory Boolean circuit Block cipher modes of operation Advanced Encryption Standard Circuit Block cipher Theoretical computer science Cryptography Applied mathematics
974	A Course in Machine Learning Hal Daumé III 10 \| L EARNING T HEORY Add to Reading List Source URL: ciml.info Language: English - Date: 2014-09-24 16:08:31 Computational learning theory Machine learning Models of computation Computational complexity theory Probably approximately correct learning Algorithm Decision tree model VC dimension PP Theoretical computer science Applied mathematics Mathematics
975	Hardness Preserving Reductions via Cuckoo Hashing Itay Berman∗ Iftach Haitner∗ Ilan Komargodski† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-24 16:10:17 Pseudorandomness Search algorithms Hashing Computational complexity theory Pseudorandom function family Pseudorandom generator Hash function Cuckoo hashing One-way function Cryptography Theoretical computer science Mathematics
976	The tree machine? Arnaud Spiwack MINES ParisTech Abstract. A variant of Turing machines is introduced where the tape Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2015-02-19 09:03:36 Mathematics Computability theory Formal methods Turing machine Random access machine Computational complexity theory Algorithm Lambda calculus FO Theory of computation Models of computation Theoretical computer science
977	Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Random walk NP-complete problems Algebraic graph theory Centrality Tutte polynomial Theoretical computer science Computational complexity theory Mathematics
978	Survey on Cryptographic Obfuscation M´at´e Horv´ath∗ Laboratory of Cryptography and System Security (CrySyS Lab)† April 24, 2015 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-24 07:02:48 Complexity classes Obfuscation Circuit complexity Obfuscated code Ciphertext indistinguishability International Obfuscated C Code Contest NC Semantic security Multilinear map Theoretical computer science Computer programming Computational complexity theory
979	Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell) Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-01 11:38:31 Computational complexity theory Complexity classes Approximation algorithm NP-complete ACM SIGACT European Symposium on Algorithms International Colloquium on Automata Languages and Programming Uriel Feige Algorithm Theoretical computer science Applied mathematics Computer science
980	An extended abstract of this paper appears in the proceedings of the 11th ACM Conference on Computer and Communications Security—CCS 2004, Washington, DC, OctoberThis expanded version is available from the IACR Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-15 15:22:16 Computational complexity theory Coding theory Randomness Randomness extractor Extractor Advantage Ciphertext indistinguishability Leftover hash lemma Adversary model Cryptography Theoretical computer science Applied mathematics

UPDATE